Heavy-Traffic Analysis of a Multiple-Phase Network with Discriminatory Processor Sharing
نویسندگان
چکیده
منابع مشابه
Heavy-Traffic Analysis of a Multiple-Phase Network with Discriminatory Processor Sharing
Disclaimer/Complaints regulations If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library: http://uba.uva.nl/en/contact, or a letter to: Library of ...
متن کاملA survey on discriminatory processor sharing
The Discriminatory Processor Sharing (DPS) model is a multi-class generalization of the egalitarian Processor Sharing model. In the DPS model all jobs present in the system are served simultaneously at rates controlled by a vector of weights {gk > 0; k = 1, . . . , K}. If there are Nk jobs of class k present in the system, k = 1, . . . , K, each class-k job is served at rate gk/ PK j=1 gjNj . T...
متن کاملComparison of the Discriminatory Processor Sharing Policies
Discriminatory Processor Sharing (DPS) policy introduced by Kleinrock [5] is of a great interest in many application areas, including telecommunications, web applications and TCP flow modelling. Under the DPS policy the jobs priority is controlled by a vector of weights. Verifying the vector of weights, it is possible to control the service rates of the jobs and optimize system characteristics....
متن کاملTail asymptotics for discriminatory processor-sharing queues with heavy-tailed service requirements
We derive the sojourn time asymptotics for a multi-class G/G/1 queue with regularly varying service requirements operating under the Discriminatory ProcessorSharing (DPS) discipline. DPS provides a natural approach for modelling the flowlevel performance of differentiated bandwidth-sharing mechanisms. Under certain assumptions, we prove that the service requirement and sojourn time of a given c...
متن کاملGeneralised Processor Sharing Networks Fed by Heavy-tailed Traffic Flows
We consider networks where traffic is served according to the Generalised Processor Sharing (GPS) principle. GPS-based scheduling algorithms are considered important for providing differentiated quality of service in integrated-services networks. We are interested in the workload of a particular flow i at the bottleneck node on its path. Flow i is assumed to have long-tailed traffic characteris...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 2011
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.1110.0914